Genetic algorithm for binary and functional decision diagrams optimization
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Ordered Decision Diagrams Optimization
In this paper we present an approach for the optimization of ordered Binary Decision Diagrams (OBDDs), based on Genetic Algorithms. In this method we consider completely specified Boolen Functions (BFs). The method uses specific reordering heuristics [3] and combines them with principles of genetic algorithms in order to determine a good variable ordering. Only small populations are considered ...
متن کاملGenetic Algorithm for Variable Ordering of Ordered Binary Decision Diagrams
Ordered Binary Decision Diagrams are a data structure for representation and manipulation of Boolean functions often applied in VLSI design. The choice of the variable ordering largely influences the size of these structures, size which may vary from polynomial to exponential in the number of variables. A genetic algorithm is applied to find a variable ordering that minimizes the size of ordere...
متن کاملOptimization Bounds from Binary Decision Diagrams
We explore the idea of obtaining bounds on the value of an optimization problem from a discrete relaxation based on binary decision diagrams (BDDs). We show how to construct a BDD that represents a relaxation of a 0–1 optimization problem, and how to obtain a bound for a separable objective function by solving a shortest (or longest) path problem in the BDD. As a test case we apply the method t...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملAn Algorithm for Affine Approximation of Binary Decision Diagrams
This paper is concerned with the problem of Boolean approximation in the following sense: given a Boolean function class and an arbitrary Boolean function, what is the function’s best proxy in the class? Specifically, what is its strongest logical consequence (or envelope) in the class of affine Boolean functions. We prove various properties of affine Boolean functions and their representation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta universitatis - series: Electronics and Energetics
سال: 2018
ISSN: 0353-3670,2217-5997
DOI: 10.2298/fuee1802169s